|
There are two main conjectures known as the Hadwiger conjecture or Hadwiger's conjecture: * Hadwiger conjecture (graph theory), a relationship between the number of colors needed by a given graph and the size of its largest clique minor * Hadwiger conjecture (combinatorial geometry) that for any ''n''-dimensional convex body, at most 2''n'' smaller homothetic bodies are necessary to contain the original ==See also== * Hadwiger–Nelson problem on the chromatic number of unit distance graphs in the Euclidean plane * Hadwiger's theorem characterizing measure functions in Euclidean spaces 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Hadwiger conjecture」の詳細全文を読む スポンサード リンク
|